Induced path - PDFSEARCH.IO - Document Search Engine

Induced path
Results: 87

#	Item
11	Crossing-Number Critical Graphs have Bounded Path-width Petr Hlinˇ en´ y? School of Mathematical and Computing Sciences, Add to Reading List Source URL: www.fi.muni.cz Language: English - Date: 2005-02-11 15:58:00 Tree Graph property Induced path Minor Graph Planar graph End Mycielskian Line graph Graph theory Path decomposition Crossing number
12	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Hamiltonian Cycles in Triangular Grids Valentin Polishchuk∗ Esther M. Arkin† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:57:41 Induced path Cycle graph Planar graph Path Petersen graph Panconnectivity Graph theory NP-complete problems Hamiltonian path
13	CCCG 2010, Winnipeg MB, August 9–11, 2010 Watchman tours for polygons with holes Adrian Dumitrescu∗ Abstract. A watchman tour in a polygonal domain (for Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:16 Theoretical computer science Computational geometry Euclidean plane geometry Simple polygon Art gallery problem Polygon Travelling salesman problem Induced path Geometry Mathematics Polygons
14	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science
15	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science
16	Computational Balloon Twisting: The Theory of Balloon Polyhedra Erik D. Demaine∗ Martin L. Demaine∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:08:28 Polyhedron Octahedron Eulerian path Induced path Matching Route inspection problem Line graph Edge coloring Graph theory Planar graphs NP-complete problems
17	k-Cographs are Kruskalian Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-16 14:46:21 Distance-hereditary graph Neighbourhood Clique Minor Induced path Graph coloring Graph Tree Path decomposition Graph theory Graph operations Cograph
18	ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2014-10-30 10:03:20 Induced path Matching Clique Dominating set Interval graph Algebraic topology Line graph Path decomposition Graph theory Chordal graph Graph
19	C:/cygwin/research/homotopic/james-journal/paper.dvi Add to Reading List Source URL: www.cs.ust.hk Language: English - Date: 2011-01-03 01:07:02 Network theory Shortest path problem Induced path Geodesic SL Routing algorithms Matching Graph theory Theoretical computer science Mathematics
20	Algorithmic complexity of finding cross-cycles in flag complexes Michal Adamaszek, Juraj Stacho University of Warwick, UK Centre for Discrete Mathematics and its Applications (DIMAP) Add to Reading List Source URL: www.mimuw.edu.pl Language: English - Date: 2015-03-23 03:34:03 Algebraic topology Chordal graph Clique complex Graph Vietoris–Rips complex CW complex Induced path Maximal independent set Simplicial complex Graph theory Mathematics Topology